The Quantitative Linear-Time--Branching-Time Spectrum

نویسندگان

  • Ulrich Fahrenberg
  • Axel Legay
  • Claus R. Thrane
چکیده

We present a distance-agnostic approach to quantitative verification. Taking as input an unspecified distance on system traces, or executions, we develop a game-based framework which allows us to define a spectrum of different interesting system distances corresponding to the given trace distance. Thus we extend the classic linear-time–branching-time spectrum to a quantitative setting, parametrized by trace distance. We also provide fixed-point characterizations of all system distances, and we prove a general transfer principle which allows us to transfer counterexamples from the qualitative to the quantitative setting, showing that all system distances are mutually topologically inequivalent. 1998 ACM Subject Classification F.1.1 Models of Computation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Linear-Time-Branching-Time Spectrum of Behavioral Specification Theories

We propose behavioral specification theories for most equivalences in the linear-time–branching-time spectrum. Almost all previous work on specification theories focuses on bisimilarity, but there is a clear interest in specification theories for other preorders and equivalences. We show that specification theories for preorders cannot exist and develop a general scheme which allows us to defin...

متن کامل

A Coalgebraic Approach to Linear-Time Logics

We extend recent work on defining linear-time behaviour for state-based systems with branching, and propose modal and fixpoint logics for specifying linear-time temporal properties of states in such systems. We model systems with branching as coalgebras whose type arises as the composition of a branching monad and a polynomial endofunctor on the category of sets, and employ a set of truth value...

متن کامل

A Coalgebraic Approach to Quantitative Linear Time Logics

We define quantitative fixpoint logics for reasoning about linear time properties of states in systems with branching behaviour. We model such systems as coalgebras whose type arises as the composition of a branching monad with one or more polynomial endofunctors on the category of sets. The domain of truth values for our logics is determined by the choice of branching monad, as is the special ...

متن کامل

Partial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback

A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 538  شماره 

صفحات  -

تاریخ انتشار 2011